from functools import reduce
from operator import le
import sys, os
import math
from collections import Counter
TC = False
def lexiographic_sort_array(arr):
return sorted(arr, key=lambda x: str(x))
def solve():
n = int(input())
if n==20:
print(15)
elif n>10 and n<=21:
print(4)
else:
print(0)
if os.path.exists('input.txt'):
debug = True
sys.stdin = open("input.txt","r")
if TC:
for _ in range(int(input())):
solve()
else:
solve()#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n<=10) cout << 0;
if(11 <= n && n<=19) cout << 4;
if(n==20) cout << 15;
if(n==21) cout << 4;
if(22<=n && n<=25) cout << 0;
}379B - New Year Present | 1498A - GCD Sum |
1277C - As Simple as One and Two | 1301A - Three Strings |
460A - Vasya and Socks | 1624C - Division by Two and Permutation |
1288A - Deadline | 1617A - Forbidden Subsequence |
914A - Perfect Squares | 873D - Merge Sort |
1251A - Broken Keyboard | 463B - Caisa and Pylons |
584A - Olesya and Rodion | 799A - Carrot Cakes |
1569B - Chess Tournament | 1047B - Cover Points |
1381B - Unmerge | 1256A - Payment Without Change |
908B - New Year and Buggy Bot | 979A - Pizza Pizza Pizza |
731A - Night at the Museum | 742A - Arpa’s hard exam and Mehrdad’s naive cheat |
1492A - Three swimmers | 1360E - Polygon |
1517D - Explorer Space | 1230B - Ania and Minimizing |
1201A - Important Exam | 676A - Nicholas and Permutation |
431A - Black Square | 474B - Worms |